1503. Last Moment Before All Ants Fall Out of a Plank - LeetCode Solution

class Solution:
    def getLastMoment(self, n: int, left: List[int], right: List[int]) -> int:
        if not left:
            return n - min(right)
        if not right:
            return max(left)
        
        return max(max(left), n - min(right))